Knowledge Synthesis on Multidimensional Matrices
نویسندگان
چکیده
The tables containing the optimal decisions obtained when solving real decision-making problems under uncertainty are often extremely large. This raises problems related not only to the storage and management of so much information, but also to the use of these tables for knowledge retrieval and reasoning explanation purposes. In this paper, we propose turning the tables into minimum storage multidimensional matrices. Computers manage multidimensional matrices as lists, where each position is a function of the order chosen (or base) for the matrix dimensions. The optimal list includes the same knowledge as the original list, but it is compacted, which is very valuable for explaining expert reasoning. Thus, evolutionary computation is required to minimise the number of list entries. The process needs a learning procedure because of its complexity. We illustrate the ideas using our decision support system IctNeo [1] for neonatal management, outputting excellent results. The methodology is so general that it also applies to any table considered as a knowledge base. Keywords— Decision Support Systems, Decision Analysis, Influence Diagram, Decision Table, Multidimensional Matrix, KBM2L List, Combinatorial Optimisation, Explanation
منابع مشابه
Laurent Polynomial Inverse Matrices and Multidimensional Perfect Reconstruction Systems
We study the invertibility of M -variate polynomial (respectively : Laurent polynomial) matrices of size N by P . Such matrices represent multidimensional systems in various settings including filter banks, multipleinput multiple-output systems, and multirate systems. Given an N × P polynomial matrix H(z) of degree at most k, we want to find a P × N polynomial (resp. : Laurent polynomial) left ...
متن کاملMultidimensional Scaling on Multiple Input Distance Matrices
Multidimensional Scaling (MDS) is a classic technique that seeks vectorial representations for data points, given the pairwise distances between them. However, in recent years, data are usually collected from diverse sources or have multiple heterogeneous representations. How to do multidimensional scaling on multiple input distance matrices is still unsolved to our best knowledge. In this pape...
متن کاملSparse and low-rank approximations of large symmetric matrices using biharmonic interpolation
Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the distance matrix, which fits in memory and can be efficiently analyzed using met...
متن کاملComplete parametrization of synthesis in multidimensional perfect reconstruction FIR systems
Many problems in FIR filter banks, via the method of polyphase representation, can be characterized by their transfer matrices. In the case of multidimensional (MD) FIR filter banks, the resulting transfer matrices have Laurent polynomial entries in several variables. For a given analysis filter bank, this method produces a multi-input multi-output (MIMO) system (e.g. an oversampled filter bank...
متن کاملTying covariance matrices to reduce the footprint of HMM-based speech synthesis systems
This paper proposes a technique of reducing footprint of HMMbased speech synthesis systems by tying all covariance matrices. HMM-based speech synthesis systems usually consume smaller footprint than unit-selection synthesis systems because statistics rather than speech waveforms are stored. However, further reduction is essential to put them on embedded devices which have very small memory. Acc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001